A formal study of linearity axioms for fuzzy orderings

Linearity Axioms for Fuzzy Orderings: Concepts, Properties, and Difficulties

Similarity-Based Fuzzy Orderings: Recent Advances

Fuzzy orderings with reference to an underlying context of similarity were first defined by Höhle and Blanchard [9]. Since then, several authors have contributed to the development of this class of fuzzy relations, both from the theoretical and the practical side (e.g. [1–4, 7, 8]). Two problems remained open throughout several years: how to define strict fuzzy orderings and how to define lexic...

Lexicographic Composition of Fuzzy Orderings

The present paper introduces an approach to construct lexicographic compositions of similarity-based fuzzy orderings. This construction is demonstrated by means of non-trivial examples. As this is a crucial feature of lexicographic composition, the preservation of linearity is studied in detail. We obtain once again that it is essential for meaningful results that the t-norm under consideration...

A Similarity-Based Generalization of Fuzzy Orderings Preserving the Classical Axioms

Equivalence relations and orderings are key concepts of mathematics. For both types of relations, formulations within the framework of fuzzy relations have been proposed already in the early days of fuzzy set theory. While similarity (indistinguishability) relations have turned out to be very useful tools, e.g. for the interpretation of fuzzy partitions and fuzzy controllers, the utilization of...

BASES AND CIRCUITS OF FUZZIFYING MATROIDS

In this paper, as an application of fuzzy matroids, the fuzzifying greedy algorithm is proposed and an achievableexample is given. Basis axioms and circuit axioms of fuzzifying matroids, which are the semantic extension for thebasis axioms and circuit axioms of crisp matroids respectively, are presented. It is proved that a fuzzifying matroidis equivalent to a mapping which satisfies the basis ...